- Voronoi tessellation
- мозаика f Вороного
English-Russian Dictionary on Probability, Statistics, and Combinatorics. — Philadelphia and Moscow. Society for Industrial and Applied Mathematics and TVP Science Publishers. K. A. Borovkov. 1994.
English-Russian Dictionary on Probability, Statistics, and Combinatorics. — Philadelphia and Moscow. Society for Industrial and Applied Mathematics and TVP Science Publishers. K. A. Borovkov. 1994.
Centroidal Voronoi tessellation — In geometry, a centroidal Voronoi tessellation (CVT) is a special type of Voronoi tessellation or Voronoi diagrams. A Voronoi tessellation is called centroidal when the generating point of each Voronoi cell is also its mean (center of mass). It… … Wikipedia
Voronoi diagram — The Voronoi diagram of a random set of points in the plane (all points lie within the image). In mathematics, a Voronoi diagram is a special kind of decomposition of a given space, e.g., a metric space, determined by distances to a specified… … Wikipedia
Tessellation — A tessellation of pavement A honeycomb is an example of a t … Wikipedia
Tessellation — In der Mathematik wird mit einer Parkettierung der (euklidischen) Ebene, auch als Pflasterung, Belegung, Zerlegung, Kachelung oder Tessellation bezeichnet, eine lückenlose und überlappungsfreie Überdeckung der Ebene durch Parkettsteine… … Deutsch Wikipedia
Mathematical diagram — This article is about general diagrams in mathematics. For diagrams in the category theoretical sense, see Diagram (category theory). Euclid s Elements, ms. from Lüneburg, A.D. 1200 Mathematical diagrams are diagrams in the field of mathematics,… … Wikipedia
24-cell — Schlegel diagram (vertices and edges) Type Convex regular 4 polytope Schläfli symbol {3,4,3} t … Wikipedia
Delaunay triangulation — A Delaunay triangulation in the plane with circumcircles shown In mathematics and computational geometry, a Delaunay triangulation for a set P of points in the plane is a triangulation DT(P) such that no point in P is inside the circumcircle of… … Wikipedia
Natural neighbor — interpolation. The colored circles. which represent the interpolating weights, wi, are generated using the ratio of the shaded area to that of the cell area of the surrounding points. The shaded area is due to the insertion of the point to be… … Wikipedia
Lloyd's algorithm — In computer graphics and electrical engineering, Lloyd s algorithm, also known as Voronoi iteration or relaxation, is a method for evenly distributing samples or objects, usually points.Lloyd s algorithm starts with an initial distribution of… … Wikipedia
Polyhedron — Polyhedra redirects here. For the relational database system, see Polyhedra DBMS. For the game magazine, see Polyhedron (magazine). For the scientific journal, see Polyhedron (journal). Some Polyhedra Dodecahedron (Regular polyhedron) … Wikipedia
k-means clustering — In statistics and data mining, k means clustering is a method of cluster analysis which aims to partition n observations into k clusters in which each observation belongs to the cluster with the nearest mean. This results into a partitioning of… … Wikipedia